Cognitively Inspired Algorithm for Imprecise Navigation

نویسندگان

  • Melissa Shahrom
  • Zalilah Abd Aziz
چکیده

Corresponding Author: Melissa Shahrom Department of Infrastructure Engineering, University of Melbourne, Australia and Universiti Teknologi MARA Selangor, Malaysia Email: [email protected] Abstract: This paper presents an algorithm, namely the private navigation algorithm. The aim of this algorithm is to bridge the gap between high quality navigation services and low quality of location information or imprecise data. Generally, the imprecision is due to the poor positioning technology and the algorithms use to protect location privacy. The benefits of the algorithm are at least two-fold: Firstly, it provides an efficient instructions for navigation under imprecision and secondly it supports location privacy protection while using navigation services. In common navigation systems, the navigation instructions generated are based on geometry oriented representation, e.g., shortest path which is based on the distance travelled and normally involves many turns. In human wayfinding, the navigation instruction is considered efficient if the instruction can reduce the cognitive load during the wayfinding activities as well as can guide users to a destination. The algorithm applies the simplest path computations for generating simple navigation instructions due to its ability to minimize the complexity of communicating the instructions. The research examines the efficiency of the algorithm based on several performance measurers. The research also takes into account the wayfinding heuristics such as the initial orientation and agent’s behavior (passive or active), that possibly can improve agent’s navigation performance. The cognitively motivated simplest cardinal direction weighting function is introduced which reflects the complexity of communicating cardinal instructions. The results show that the private navigation algorithm was efficient when it is incorporated with wayfinding heuristic for imprecise navigation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Streets to the OPRA— Finding your destination with imprecise knowledge

Qualitative spatial calculi offer a method to describe spatial configurations in a framework based on a finite set of relations that abstracts from the underlying mathematical theory. But an open issue is whether they can be employed in applications. Further their cognitive adequacy is questionable or not investigated at all. In this paper we investigate the applicability of OPRA to navigation ...

متن کامل

A Navigation System for Autonomous Robot Operating in Unknown and Dynamic Environment: Escaping Algorithm

In this study, the problem of navigation in dynamic and unknown environment is investigated and a navigation method based on force field approach is suggested. It is assumed that the robot performs navigation in...

متن کامل

An Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks

  We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...

متن کامل

Hybrid Improved Dolphin Echolocation and Ant Colony Optimization for Optimal Discrete Sizing of Truss Structures

This paper presents a robust hybrid improved dolphin echolocation and ant colony optimization algorithm (IDEACO) for optimization of truss structures with discrete sizing variables. The dolphin echolocation (DE) is inspired by the navigation and hunting behavior of dolphins. An improved version of dolphin echolocation (IDE), as the main engine, is proposed and uses the positive attributes of an...

متن کامل

BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems

Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JCS

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2016